Replicable parallel branch and bound search
نویسندگان
چکیده
منابع مشابه
Replicable parallel branch and bound search
Combinatorial branch and bound searches are a common technique for solving global optimisation and decisionproblems. Their performance oftendepends on good search order heuristics, refined over decades of algorithms research. Parallel search necessarily deviates from the sequential search order, sometimes dramatically and unpredictably, e.g. by distributing work at random. This can disrupt effe...
متن کاملParallel Branch-and-Bound Graph Search for Correlated Association Rules
There have been proposed e cient ways of enumerating all the association rules that are interesting with respect to support, con dence, or other measures. In contrast, we examine the optimization problem of computing the optimal association rule that maximizes the signi cance of the correlation between the assumption and the conclusion of the rule. We propose a parallel branch-and-bound graph s...
متن کاملParallel Branch-and-Bound Algorithms
1.1. INTRODUCTION In the beginning of the twenty-first century, large unsolved combinatorial optimization problems have been solved exactly. Two impressive cases should be mentioned. First are two instances of the Monde, Transfert) newspapers. This impressive media frenzy reflected the impact of the achievement, which was deemed of the same order of magnitude as the victory of IBMs parallel com...
متن کاملParallel Branch and Bound and Anomalies
In this paper we present a classification of parallel branch and bound algorithms and investigate the anomalies which can occur during the execution of such algorithms. We develop sufficient conditions to prevent deceleration anomalies from degrading the performance. Such conditions were already known for some synchronous cases. It turns out that these conditions can be generalized to arbitrary...
متن کاملAsynchronous Parallel Branch and Bound and Anomalies
The parallel execution of branch and bound algorithms can result in seemingly unreasonable speedups or slowdowns. Almost never the speedup is equal to the increase in computing power. For synchronous parallel branch and bound, these effects have been studied extensively. For asynchronousparallelizations, only little is known. In this paper, we derive sufficient conditions to guarantee that an a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2018
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2017.10.010